A hybrid PSO approach for solving non-convex optimization problems
نویسندگان
چکیده
منابع مشابه
Hybrid PSO-tabu search for constrained non-linear optimization problems
In this paper we present a new method to solve a constrained non-linear problem. The method is based on hybridizing the Particle Swarm Optimization and tabu-search meta-heuristics (PSOTS). Tow tabu-lists are used within the PSO algorithm: the first one aims to diversify the best solutions obtained by particles when the second bans temporarily solutions non-respecting the constraints. The obtain...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملA new heuristic approach for non-convex optimization problems
Abstract. In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous, non-convex optimization problems. The principle of HKA is to explicitly consider the optimization problem as a measurement process designed to give an estimate of the optimum. A specific procedure, based on...
متن کاملHONOR: Hybrid Optimization for NOn-convex Regularized problems
Recent years have witnessed the superiority of non-convex sparse learning formulations over their convex counterparts in both theory and practice. However, due to the non-convexity and non-smoothness of the regularizer, how to efficiently solve the non-convex optimization problem for large-scale data is still quite challenging. In this paper, we propose an efficient Hybrid Optimization algorith...
متن کاملA Hybrid of Random Search and PSO for Solving Constrained Multi-Objective Optimization Problems
Suitable solutions for multi-objective optimization problems are investigated as a set of solutions in the literature, each of which satisfies the objectives at an acceptable level without being dominated by any other solution. The proposed algorithm in this paper is a hybrid of the particle swarm optimization algorithm [1] and a random search technique with quadratic approximation formula[2] n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Control Sciences
سال: 2012
ISSN: 1230-2384
DOI: 10.2478/v10170-011-0014-2